Exact Methods for the Traveling Salesman Problem with Drone
نویسندگان
چکیده
Efficiently handling last-mile deliveries becomes more and important nowadays. Using drones to support classical vehicles allows improving delivery schedules as long efficient solution methods plan with are available. We study exact approaches for some variants of the traveling salesman problem drone (TSP-D) in which a truck teamed up serve set customers. This combination can exploit benefits both vehicle types: has large capacity but usually low travel speed urban areas; is faster not restricted street networks, its range carrying limited. propose compact mixed-integer linear program (MILP) several TSP-D that based on timely synchronizing flows; such an MILP easy implement nevertheless leads competitive results compared state-of-the-art MILPs. Furthermore, we introduce dynamic programming recursions model variants. show how these be exploited branch-and-price approach partitioning formulation using ng-route relaxation three-level hierarchical branching. The proposed solve instances 39 customers optimality outperforming by than doubling manageable instance size. Finally, analyze different scenarios even single significantly reduce route’s completion time when sufficiently fast.
منابع مشابه
Optimization Approaches for the Traveling Salesman Problem with Drone
The fast and cost-efficient home delivery of goods ordered online is logistically challenging. Many companies are looking for new ways to cross the last-mile to their customers. One technology-enabled opportunity that recently has received much attention is the use of a drone to support deliveries. An innovative last-mile delivery concept in which a truck collaborates with a drone to make deliv...
متن کاملDynamic Programming Approaches for the Traveling Salesman Problem with Drone
A promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a drone and a truck gives rise to a new planning problem that is known as the Traveling Salesman Problem with Drone (TSP-D). This paper presents an exact solution approach for the TSP-D based on dynamic programming and present experimental results of diffe...
متن کاملOn the Min-cost Traveling Salesman Problem with Drone
Once known to be used exclusively in military domain, unmanned aerial vehicles (drones) have stepped up to become a part of new logistic method in commercial sector called "last-mile delivery". In this novel approach, small unmanned aerial vehicles (UAV), also known as drones, are deployed alongside with trucks to deliver goods to customers in order to improve the service quality or reduce the ...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2021
ISSN: ['0041-1655', '1526-5447']
DOI: https://doi.org/10.1287/trsc.2020.1017